Nonatomic dual bakery algorithm with bounded tokens
نویسندگان
چکیده
منابع مشابه
General Statistically Secure Computation with Bounded-Resettable Hardware Tokens
Universally composable secure computation was assumed to require trusted setups, until it was realized that parties exchanging (untrusted) tamper-proof hardware tokens allow an alternative approach (Katz; EUROCRYPT 2007). This discovery initialized a line of research dealing with two different types of tokens. Using only a single stateful token, one can implement general statistically secure tw...
متن کاملThe Black-White Bakery Algorithm and Related Bounded-Space, Adaptive, Local-Spinning and FIFO Algorithms
A mutual exclusion algorithm is presented that has four desired properties: (1) it satisfies FIFO fairness, (2) it satisfies localspinning, (3) it is adaptive, and (4) it uses finite number of bounded size atomic registers. No previously published algorithm satisfies all these properties. In fact, it is the first algorithm (using only atomic registers) which satisfies both FIFO and local-spinni...
متن کاملSeveral Tokens in Herman's algorithm
We have a cycle of N nodes and there is a token on an odd number of nodes. At each step, each token independently moves to its clockwise neighbor or stays at its position with probability 2 . If two tokens arrive to the same node, then we remove both of them. The process ends when only one token remains. The question is that for a fixed N , which is the initial configuration that maximizes the ...
متن کاملBounded approximate connes-amenability of dual Banach algebras
We study the notion of bounded approximate Connes-amenability for dual Banach algebras and characterize this type of algebras in terms of approximate diagonals. We show that bounded approximate Connes-amenability of dual Banach algebras forces them to be unital. For a separable dual Banach algebra, we prove that bounded approximate Connes-amenability implies sequential approximat...
متن کاملThree Tokens in Herman ’ s Algorithm 1
Herman’s algorithm is a synchronous randomized protocol for achieving self-stabilization in a token ring consisting of N processes. The interaction of tokens makes the dynamics of the protocol very difficult to analyze. In this paper we study the distribution of the time to stabilization, assuming that there are three tokens in the initial configuration. We show for arbitrary N and for an arbit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Informatica
سال: 2011
ISSN: 0001-5903,1432-0525
DOI: 10.1007/s00236-011-0132-0